Ergodic Properties of Randomly Coloured Point Sets
نویسندگان
چکیده
منابع مشابه
Balanced lines in two–coloured point sets
Let B and R be point sets (of blue and red points, respectively) in the plane, such that P := B ∪R is in general position, and |P | is even. A line l is balanced if it spans one blue and one red point, and on each open halfplane of l, the number of blue points minus the number of red points is the same. We prove that P has at least min{|B|, |R|} balanced lines. This refines a result by Pach and...
متن کاملErgodic Sets
Introduction. Ergodic sets were introduced by Kryloff and Bogoliouboff in 1937 in connection with their study of compact dynamical systems [16]. The purpose of this paper is to review some of the work that has since been done on the theory that centers around this notion, and to present a number of supplementary remarks, applications, and simplifications. For simplicity we shall confine attenti...
متن کاملLarge Deviations in Randomly Coloured Random Graphs
Models of random graphs are considered where the presence or absence of an edge depends on the random types (colours) of its vertices, so that whether or not edges are present can be dependent. The principal objective is to study large deviations in the number of edges. These graphs provide a natural example with two different non-degenerate large deviation regimes, one arising from large devia...
متن کاملSOME ERGODIC PROPERTIES OF HYPER MV {ALGEBRA DYNAMICAL SYSTEMS
This paper provides a review on major ergodic features of semi-independent hyper MV {algebra dynamical systems. Theorems are presentedto make contribution to calculate the entropy. Particularly, it is proved that thetotal entropy of those semi-independent hyper MV {algebra dynamical systemsthat have a generator can be calculated with respect to their generator ratherthan considering all the par...
متن کاملTropical Dominating Sets in Vertex-Coloured Graphs
Given a vertex-coloured graph, a dominating set is said to be tropical if every colour of the graph appears at least once in the set. Here, we study minimum tropical dominating sets from structural and algorithmic points of view. First, we prove that the tropical dominating set problem is NP-complete even when restricted to a simple path. Then, we establish upper bounds related to various param...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Canadian Journal of Mathematics
سال: 2013
ISSN: 0008-414X,1496-4279
DOI: 10.4153/cjm-2012-009-7